Quantum Entanglement and Communication Complexity
نویسندگان
چکیده
منابع مشابه
Quantum Entanglement and Communication Complexity
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used to simulate a communication channel, it can reduce the communication complexity of functions in some cases. Specifically, we show that, for a particular func...
متن کاملMulti-partite entanglement, communication complexity and quantum Helly-type theorems
We develop protocols for preparing the GHZ state (a pure tri-partite maximally entangled state) and, in general, a pure n-partite maximally entangled state using EPR pairs shared amongst n agents and classical communication between the agents. We observe that the combinatorial arrangement of EPR pairs required for this purpose is like that in Helly-type theorems in geometry. PACS numbers: 03.65...
متن کاملA Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملClassical complexity and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace ofM(N) contains a non-singular matrix, whereM(N) stands for the linear space of complexN ×N matrices. This problem led to many fundamental developments in matroid theory, etc. Cla...
متن کاملQuantum communication and complexity
In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be signiicantly lowered if we allow the parties the use of quantum communication. We survey the main results of the young area of quantum communication complexity: its relation to telepo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i40.18966